منابع مشابه
Cutting through Regular Post Embedding Problems
The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to undecidability.
متن کاملThe Parametric Ordinal-Recursive Complexity of Post Embedding Problems
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) and prove parametric lower bounds depending on the size of the alphabet.
متن کاملGeneralized De-embedding Techniques
This paper discusses techniques for embedding and de-embedding the characteristics of two-port devices described by scattering parameters at microwave frequencies. Such techniques have wide applications in areas such as the measurement of the parameters of a semiconductor device mounted in a fixture, removal of the effects of cables, adapters, etc. and network analyzer calibration using variant...
متن کاملEmbedding problems of division algebras
A finite group G is called admissible over a given field if there exists a central division algebra that contains a G-Galois field extension as a maximal subfield. We give a definition of embedding problems of division algebras that extends both the notion of embedding problems of fields as in classical Galois theory, and the question which finite groups are admissible over a field. In a recent...
متن کاملEmbedding Problems and Finite Quotients
We give a condition on a family of solutions of quotients of an embedding problem which implies the embedding problem has a solution. This shows, in particular, that to solve an embedding problem associated to the maximal extension of a number field unramified outside a fixed finite set of places, it suffices to find a solution for each finite quotient of the embedding problem. This statement i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2014
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-014-9561-9